Corrigendum to "Sets of elements that pairwise generate a linear group" [J. Combin. Theory Ser. A 115 (3) (2008) 442-465]

نویسندگان

  • John R. Britnell
  • A. Evseev
  • Robert M. Guralnick
  • P. E. Holmes
  • Attila Maróti
چکیده

a Department of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK b School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK c Department of Mathematics, University of Southern California, Los Angeles, CA 90089-2532, USA d DPMMS, Centre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0BW, UK e Alfréd Rényi Institute of Mathematics, Budapest, Hungary

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sets of elements that pairwise generate a linear group

Let G be any of the groups (P )GL(n, q), (P )SL(n, q). Define a (simple) graph Γ = Γ(G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. We prove that if the dimension n is at least 12 and not congruent to 2 modulo 4, then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ. This work was motivated by a question of ...

متن کامل

Cycles in a tournament with pairwise zero, one or two given vertices in common

Chen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theory Ser. B 83 (2001) 213–220] proved that every k-connected tournament with at least 8k vertices admits k vertex-disjoint cycles spanning the vertex set, which answered a question posed by Bollobas. In this paper, we prove, as a consequence of a more general result, that every k-connected tournament of dia...

متن کامل

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. The...

متن کامل

Codes from Cubic Curves and their Extensions

We study the linear codes and their extensions associated with sets of points in the plane corresponding to cubic curves. Instead of merely studying linear extensions, all possible extensions of the code are studied. In this way several new results are obtained and some existing results are strengthened. This type of analysis was carried out by Alderson, Bruen, and Silverman [J. Combin. Theory ...

متن کامل

On flows in bidirected graphs

Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279–292]. He proved that this conjecture is true with 6 replaced by 216. Zyka proved in his Ph.D dissertation that it is true with 6 replaced by 30. Khelladi prove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 118  شماره 

صفحات  -

تاریخ انتشار 2011